Dynamic Spectrum Management: A Complete Complexity Characterization

Dynamic Spectrum Management

Complete Problems for Dynamic Complexity Classes

We present the first complete problems for dynamic complexity classes including the classes Dyn-FO and Dyn-ThC , the dynamic classes corresponding to relational calculus and (polynomially bounded) SQL, respectively. The first problem we show complete for Dyn-FO is a singlestep version of the circuit value problem (SSCV). Of independent interest, our construction also produces a first-order form...

On an open question about the complexity of a dynamic spectrum management problem

In this paper we discuss the complexity of a dynamic spectrum management problem within a multi-user communication system with K users and N available tones. In this problem a common utility function is optimized. In particular, so called min-rate, harmonic mean and geometric mean utility functions are considered. The complexity of the optimization problems with these utility functions is alrea...

Regulation for dynamic spectrum management

Aalto University, P.O. Box 11000, FI-00076 Aalto www.aalto.fi Author Arturo Basaure Name of the doctoral dissertation Regulation for dynamic spectrum management Publisher School of Electrical Engineering Unit Department of Communications and Networking, Comnet Series Aalto University publication series DOCTORAL DISSERTATIONS 127/2016 Field of research Network Economics Manuscript submitted 17 M...

A Complete Characterization of Complexity for Boolean Constraint Optimization Problems

We analyze the complexity of optimization problems expressed using valued constraints. This very general framework includes a number of well-known optimization problems such as MAX-SAT, and Weighted MAX-SAT, as well as properly generalizing the classical CSP framework by allowing the expression of preferences. We focus on valued constraints over Boolean variables, and we establish a dichotomy t...